Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Spyros Angelopoulos and Shahin Kamali. Rényi-Ulam Games and Online Computation with Imperfect Advice. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{angelopoulos_et_al:LIPIcs.MFCS.2023.13, author = {Angelopoulos, Spyros and Kamali, Shahin}, title = {{R\'{e}nyi-Ulam Games and Online Computation with Imperfect Advice}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {13:1--13:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.13}, URN = {urn:nbn:de:0030-drops-185474}, doi = {10.4230/LIPIcs.MFCS.2023.13}, annote = {Keywords: Online computation, R\'{e}nyi-Ulam games, query models, beyond worst-case analysis} }
Published in: LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, and Marc Renault. Online Computation with Untrusted Advice. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 151, pp. 52:1-52:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{angelopoulos_et_al:LIPIcs.ITCS.2020.52, author = {Angelopoulos, Spyros and D\"{u}rr, Christoph and Jin, Shendan and Kamali, Shahin and Renault, Marc}, title = {{Online Computation with Untrusted Advice}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {52:1--52:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-134-4}, ISSN = {1868-8969}, year = {2020}, volume = {151}, editor = {Vidick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.52}, URN = {urn:nbn:de:0030-drops-117372}, doi = {10.4230/LIPIcs.ITCS.2020.52}, annote = {Keywords: Online computation, competitive analysis, advice complexity, robust algorithms, untrusted advice} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Joan Boyar, Shahin Kamali, Kim S. Larsen, and Alejandro López-Ortiz. Online Bin Packing with Advice. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 174-186, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{boyar_et_al:LIPIcs.STACS.2014.174, author = {Boyar, Joan and Kamali, Shahin and Larsen, Kim S. and L\'{o}pez-Ortiz, Alejandro}, title = {{Online Bin Packing with Advice}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {174--186}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.174}, URN = {urn:nbn:de:0030-drops-44565}, doi = {10.4230/LIPIcs.STACS.2014.174}, annote = {Keywords: online algorithms, advice complexity, bin packing} }
Feedback for Dagstuhl Publishing